A repair algorithm for composite laminates to satisfy lay-up design guidelines
نویسندگان
چکیده
منابع مشابه
Permutation genetic algorithm for stacking sequence design of composite laminates
Stacking sequence design of a composite laminate with a given set of plies is a combinatorial problem of seeking an optimal permutation. Permutation genetic algorithms optimizing the stacking sequence of a composite laminate for maximum buckling load are studied. A new permutation GA named gene±rank GA is developed and compared with an existing Partially Mapped Permutation GA, originally develo...
متن کاملAn ant colony algorithm applied to lay - up optimization of laminated composite plates
Ant colony optimization (ACO) is a class of heuristic algorithms proposed to solve optimization problems. The idea was inspired by the behavior of real ants, related to their ability to find the shortest path between the nest and the food source. ACO has been applied successfully to different kinds of problems. So, this manuscript describes the development and application of an ACO algorithm to...
متن کاملComparative Analysis of Drills for Composite Laminates
The characteristics of carbon fibre reinforced plastics allow a very broad range of uses. Drilling is often necessary to assemble different components, but this can lead to various forms of damage, such as delamination which is the most severe. However, a reduced thrust force can decrease the risk of delamination. In this work, two variables of the drilling process were compared: tool material ...
متن کاملDirect Composite Laminates - A Case Report
Rehabilitation of lost dental aesthetic is one of the most important concerns for contemporary dentistry. Conservative treatment modality along with aesthetic approaches, such as direct and indirect laminate veneer restorations were the treatment of choice. Laminate veneers are restorations to correct aesthetic deficiencies and discolorations. Direct laminate veneers involve the application of ...
متن کاملA new algorithm for computing SAGBI bases up to an arbitrary degree
We present a new algorithm for computing a SAGBI basis up to an arbitrary degree for a subalgebra generated by a set of homogeneous polynomials. Our idea is based on linear algebra methods which cause a low level of complexity and computational cost. We then use it to solve the membership problem in subalgebras.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Composite Structures
سال: 2021
ISSN: 0263-8223
DOI: 10.1016/j.compstruct.2020.113448